Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
نویسنده
چکیده
One usually defines the notion of a computable real number by using recursive functions. However, there is a simple way due to A. Mostowski to characterize the computable real numbers by using only primitive recursive functions. We prove Mostowski’s result differently and apply it to get other simple characterizations of this kind. For instance, a real number is shown to be computable if and only if it belongs to all members of some primitive recursive sequence of nested intervals with rational end points and with lengths arbitrarily closely approaching 0.
منابع مشابه
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive analysis. In a different and orthogonal work, we proposed a minimalization schema that allows to provide a class of real recursive functions that corresponds to extensions of computable functions over the integers. Mixi...
متن کاملElementarily computable functions over the real numbers and R-sub-recursive functions
We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we prove that they correspond to the smallest class of functions that contains some basic functions, and closed by composition, linear integration, and a simple limit schema. We generalize this result to all higher levels of the G...
متن کاملPrimitive Recursiveness of Real Numbers under Different Representations
In mathematics, various representations of real numbers have been investigated, such as nested interval representations, Cauchy sequences, ... • The effective versions of these representations are equivalent in the sense that they define the same notion of computability of real numbers. • However, the primitive recursive (p.r., for short) versions of these representations can lead to different ...
متن کاملAn Analog Characterization of Elementarily Computable Functions over the Real Numbers
We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we prove that they correspond to the smallest class of functions that contains some basic functions, and closed by composition, linear integration, and a simple limit schema. We generalize this result to all higher levels of the G...
متن کاملA characterization of computable analysis on unbounded domains using differential equations
The functions of computable analysis are defined by enhancing normal Turing machines to deal with real number inputs. We consider characterizations of these functions using function algebras, known as real recursive functions. Since there are numerous incompatible models of computation over the reals, it is interesting to find that the two very different models we consider can be set up to yiel...
متن کامل